On Minimizing Regression-Suites using On-Line Set-Cover

نویسنده

  • Erez Buchnik
چکیده

This paper is about the experience gained in IBM Haifa Research Lab (HRL) in creating regression-suites and minimizing their size, while maintaining high quality as measured by coverage. The problem that we solve, while similar to the one addressed in the literature, has a key difference; the compaction algorithm has to be implemented on-line due to the large number of tests processed. We compare strategies for implementing on-line set-cover. The trade-offs are between quality of solution (as expressed by the size of the test suite), memory and CPU. We show that on-line compaction strategies, on our data, are almost as good as keeping all the tests and then compacting off-line.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compacting regression-suites on-the-fly

Testing is one of the biggest problems of the software industry. Coverage is the main technique for showing that the testing has been thorough. Coverage can be used to find a good regression-suite, i.e. a set of tests that is run on the application after software or data changes in order to check that no new bugs were introduced. This paper is about the experience gained in IBM Haifa Research L...

متن کامل

A probabilistic alternative to regression suites

Automated regression suites are essential in developing large applications, while maintaining reasonable quality and timetables. Themain argument against the automation of regression suites, in addition to the cost of creation and maintenance, is the observation that if you run the same test many times, it becomes increasingly less likely to find bugs. To alleviate such problems, a new regressi...

متن کامل

Minimizing Test Execution Time During Test Generation

In the area of model based testing, major improvements have been made in the generation of conformance tests using a model checker. Unfortunately, the execution of the generated test suites tend to be rather time-consuming. In [1] we presented a method to generate the test suites with the shortest execution time providing the required coverage, but this method can only be applied to small model...

متن کامل

Mixed-Model Assembly Line Balancing with Considering Reliability

This paper presents a multi-objective simulated annealing algorithm for the mixed-model assembly line balancing with stochastic processing times. Since, the stochastic task times may have effects on the bottlenecks of a system, maximizing the weighted line efficiency (equivalent to the minimizing the number of station), minimizing the weighted smoothness index and maximizing the system reliabil...

متن کامل

Meta heuristic for Minimizing Makespan in a Flow-line Manufacturing Cell with Sequence Dependent Family Setup Times

This paper presents a new mathematical model for the problem of scheduling part families and jobs within each part family in a flow line manufacturing cell where the setup times for each family are sequence dependent and it is desired to minimize the maximum completion time of the last job on the last machine (makespan) while processing parts (jobs) in each family together. Gaining an optimal s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997